MONA Implementation Secrets

MONA Implementation Secrets

The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in practice, even though it faces a theoretically non-elementary worst-case complexity. The implementation has matured over a period of six years. Compared to the first naive version, the present tool is faster by several or...

UPPAAL Implementation Secrets

In this paper we present the continuous and on-going development of datastructures and algorithms underlying the verification engine of the tool Uppaal. In particular, we review the datastructures of Difference Bounded Matrices, Minimal Constraint Representation and Clock Difference Diagrams used in symbolic state-space representation and -analysis for real-time systems. In addition we report o...

Characterization of a novel simian immunodeficiency virus (SIVmonNG1) genome sequence from a mona monkey (Cercopithecus mona).

A novel simian immunodeficiency virus (SIV) sequence has been recovered from RNA extracted from the serum of a mona monkey (Cercopithecus mona) wild born in Nigeria. The sequence was obtained by using novel generic (degenerate) PCR primers and spans from two-thirds into the gag gene to the 3' poly(A) tail of the SIVmonNG1 RNA genome. Analysis of the open reading frames revealed that the SIVmonN...

Mona as a DL Reasoner

Tangles and the Mona Lisa

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This translates to a small data set from which the image can be reconstructed. The tangle duality theorem says that a graph either has a certainorder tangle or a tree-...